Generalized Directable Automata
نویسندگان
چکیده
In [18] the last three authors introduced the notion of a generalized directable automaton as a generalization of many already known types of automata. The algorithms for testing whether a finite automaton belongs to some of important subclasses of the class of generalized directable automata are studied by the authors in [20]. In this paper structural properties of finite and infinite generalized directable automata are considered, tests for membership of a finite automaton in the pseudovarieties of generalized directable and locally directable automata are given, and the least generalized directing and locally directing congruences on a finite automaton are described.
منابع مشابه
Generalized Directable Fuzzy Automata
In this paper, we introduce generalized directable fuzzy automaton and discuss their structural characterizations. We have shown that a generalized directable fuzzy automaton is an extension of a uniformly monogenically strongly directable fuzzy automaton by a uniformly monogenically trap-directable fuzzy automaton and obtain other equivalent conditions for a generalized directable fuzzy automa...
متن کاملDecompositions of Automata and Transition Semigroups
The purpose of this paper is to describe structural properties of automata whose transition semigroups have a zero, left zero, right zero or bi-zero, or are nilpotent extensions of rectangular bands, left zero bands or right zero bands, or are nilpotent. To describe the structure of these automata we use various well-known decomposition methods of automata theory – direct sum decompositions, su...
متن کاملSome Remarks on the Π-directable Automata and Definite Automata: a Survey
The concept of π-directable automata is a concomitant specialization concept of the directable automata and generalization of the concept definite automata. The main purpose of this survey is to describe certain properties of πdirectable and definite automata. These are mainly algebraic and structural properties, as well as the properties of their transition semigroups. Various specializations ...
متن کاملThe Cerny Conjecture for Automata with Blocking States
In [7], Jan Černý conjectured that an arbitrary directable automaton with n states has a directing word of length not longer than (n−1). This conjecture is one of the most longstanding open problems in the theory of finite automata. Most of papers dealing with this conjecture reduce the problem to special classes of automata. In present paper we deal with this conjecture in the class of automat...
متن کاملOn Monogenic Nondeterministic Automata
A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways, three such notions, D1-, D2-, and D3-directability, are used. In this paper, we consider monogenic n.d. automata, and for each i = 1, 2, 3, we present sharp bounds for t...
متن کامل